The Computer Journal 1991: Vol 34 Index

Index for The Computer Journal, Volume 34

1. Index of titles of Papers, etc

A Controlled Environment for Meta-Message Processing 331

A DAP FORTRAN Subroutine for Thinning Digitised Pictures
377

A Framework for Building Dependable Systems 173

A Longest Path Algorithm to Display Decision Tables 358

A Mergeable Double-ended Priority Queue 423

A Model for the Stability Analysis of Maintenance Strategies for
Linear List 80

A Modification of Sale’s Algorithm to Accommodate FORTRAN
77 (373

A Neural Network Simulating System 92

A New Technique for Self-Organising Linear Searches 450

A Note on the Efficiency of an Interval Routing Algorithm 475

A Parallel Prolog Abstract Machine and its Multi-Transputer
Implementation 52

A Query Language for Retrieving Information from Hierarchic Text
Structures 254

A Structured Semantic Design of Distributed Operating Systems
482

A Survey of Exploratory Software Development 153

A Survey on Binary Tree Codings 438

Adaptive Deadlock-free Packet Routing in Transputer-based Multi-
processor Interconnection Networks 493

Additional papers 571

An Adaptive Overflow Technique to Defer Splitting in B-trees 397

An Efficient Starvation-Free Semaphore Solution for the Graphical
Mutual Exclusion Problem 345

An Examination of Requirements Specification Languages 143

An Introduction to Knuth—Bendix Completion 2

Announcements 87, 91, 94, 121, 142, 152, 163, 181, 185, 238, 244,
271, 286, 344, 349, 381, 414, 437, 454, 468, 476, 477, 492, 541,
550, 558, 565

Autodescriptivity: beware! 380

Book Reviews 15, 41, 187, 188, 194, 301, 319, 357, 396, 422, 474,
S25, 533,513

Comparative Performance of Overlapping Connectivity Multi-
processor Interconnection Networks 207

Concurrent Object-Oriented Programming in Lisp 311

Constraint Maintenance as a Data Model Design Criterion 73

Constructive Rewriting 34

Correspondence 72, 206, 264, 310, 405, 427, 502, 513

Default Databases and Incomplete Information 239

Design Approaches: A Comparative Study of Information System
Design and Architectural Design 215

Development Methods for Real-Time Systems 164

Editorial 1, 97, 193, 289, 385, 481

Efficient Dissemination of Information in Computer Networks 534

Efficient Generation of Rotational-Admissible Codewords for
Binary Trees 379

Efficient Two-Dimensional Fast Fourier Transform Subroutines for
Real-Valued or Hermitian data 362

Empirical Study of the Expected Running Time of Shellsort 88

Fault-tolerant Reference Counting for Garbage Collection in
Distributed Systems 503
Finding a Majority When Sorting is Not Available 186

HIDEL: A Language for Hierarchical VLSI Design 195
High Storage Utilisation for Single-Probe Retrieval Linear Hashing
455

Implementation of Flexible Arrays Using Balanced Trees 386

Implementation of Karp—Luby Monte Carlo Method: An Exercise
in Approximate Counting 279

Implementations of Term Rewriting Systems 20

Improved Partial-Match Search Algorithms for BD Trees 415

Improved Recursion Handling through Integrity Constraints 282

Information Systems Design Methodologies — Book Reviews 182

Information Systems Development Research: An Exploration of
Ideas in Practice 98

‘Innovation for Failure’ - Some Reflections on the Work of the
NRDC Relevant to the Early History of the Computer Industry
in the UK 272

Integrating Human-Computer Interaction with Jackson System
Development 132

I-Pigs: an Interactive Graphical Environment for Concurrent
Programming 320

Linear Probing Sort 370
Logic Programming for Software Verification and Testing 350

Manipulating Full-text Scientific Databases: A Logic-based
Semantico-pragmatic Approach 245

Methodologies from Machine Learning in Data Analysis and
Software 559

Mu-balancing M-way Search Trees 406

Multimedia Information Systems —- The Management and Semantic
Retrieval of all Electronic Data Types 225

Notices 188

On the Design of a Machine-Independent Perfect Hashing Scheme
469

Order-sorted Term Rewriting 16
Ord-Smith’s Pseudo-Lexicographical Permutation Procedure is the
Tompkins—Paige Algorithm 569

Performance of Priority Queue Structures in a Virtual Memory
Environment 428

Practical Concurrent Programming for Parallel Machines 302

Prolog in Practical Compiler Writing 64

Reduction and Narrowing for Horn Clause Theories 42
Representing Business Policies in the Jackson System Development
Method 122

Seven Ways to Develop Office Systems: A Managerial Comparison
of Office System Development Methodologies 113
Structure Clashes 566

The Coordinatation of Distributed Active Messages in a Dynamic
Network Topology 542

The Design of a System for Distributing Shared Objects 514

The HDG-Machine: a Highly Distributed Graph-Reducer for a
Transputer Network 290

Threshold Values for Processing Distributed Queries 551

Unity Doesn’t Imply Unification or Overcoming Heterogeneity
Problems in Distributed Software Engineering Environments
522

Weighting Without Waiting: the Weighted Path Length Tree 444

When does a Mouse become a Rat? or ... Comparing Performance
and Preferences in Direct Manipulation and Command Line
Environment 265

Wilkes Award 112

2. Index of Authors and Other Contributors
Agrawal, D. and Malpani, A. 534
Akman, V. 279
Ancona, M., Clematis, A., De Floriani, L. and Puppo, E. 195
Argo, G. 444
Avison, D. E. and Wood-Harper, A. T. 98

Bastani, F. B., Chen, I.-R. and Hilal, W. 80
Bodorik, P. and Riordon, J. S. 55i

Bradford, R. see Padget, J.

Brink, C., Rewitzky, I. M. and Schmidt, R. A. 380
Burn, G. L. see Kingdon, H.

Burns, A. and Lister, A. M. 173

Campbell, D. and McNeill, T. 186

Challab, D. J. 386

Chang, C. C., Chen, C. Y. and Jan, J. K. 469
Chen, C. Y. see Chang, C.C. .

Chen, I.-R. see Bastani, F. B.

Cheng, S.-T. see Wu, J.-L.

Clematis, A. see Ancona, M.

Clint, M. see Stewart, A.

THE COMPUTER JOURNAL, VOL. 34, 1991

|

Dandamudi, S. P. and Sorenson, P.G. 415 Shahid, A. A. see Yannakoudakis, E. J.

Daskalakis, C. N. see O’Docherty, M. H. Shrivastava, S. K. see Mancini, L.

Daszczuk, W. B. 482 Skillicorn, D. B. 302

De Floriani, L. see Ancona, M. Slape, J. K. and Wallis, P. J. L. 373

Dick, A. J.J. 2 Small, C. see King. P.

Dick, A. J. J. and Watson, P. 16 Smyth, W. F. 406

Dobosiewicz, W. 370 Son, N. T. and Paker, Y. 493

Dollimore, J., Miranda, E. and Xu, Wang 514 Sorenson, P. G. see Dandamudi, S. P.
Srinivasen, B. 397

Fenwick, P.M. 450 Stewart, A., Holt, C., Clint, M. and Perrott, R. 377

Fitch, J. see Padget, J. Sutcliffe, A. G. and Wang, I. 132

Geesink, L.H. 542 Thanisch, P. F. see Wicovsky, K.

Gibbs, S. see Morgan, K. Tharp, A. L. see Ou, S. F.
Trenouth, J. 153

Hagan, B. J. see Hull, M. E. C. Tse, T. H. and Pong, L. 143

Halsbury, The Rt. Hon. the Earl of 272 E

Hammersley, A. P. 362

Hammersley, P. 182 Verrall, M. 5

eet and Kirchner, H. 20 Wallis, P. J. L. see Slape, J. K.

Holt. C ko Siveant A M4 Wang, I. see Sutcliffe, A. G.

. Watson, P. see Dick, A. J. J.
Hull, M. E. C., O'Donoghue, P. G. and Hagan, B. J. 164 Weiss, M.A. 88

Wen, Z. see Olariu, S.
Jacob, R.T., see Yue, K Wicovsky, K., Thanisch, P. F. and Williams, M. H. 282
Jan, J. K. see Chang, C. C. Wilkinson, B. 207
Williams, M. H. see Wicovsky, K
en | Wood-Harper, A. T. see Avison, D. E.
King, P. and Small, C. 239 Wu, J.-L. and Cheng, S.-T. 92
Kingdon, H., Lester, D. R. and Burn, G. L. 290
Kirchner, C. see Hermann, M.
Kirchner, H. see Hermann, M. Yannakoudakis, E. J. and Shahid, A. A. 331
Yue, K. and Jacob, R. T. 345
Lahodynskyj, L.A. 566

Lester, D. R. see Kingdon, H
Lister, A. M. see Burns, A. 3. Index of Topics, etc

Abstract parallel machine 290
Macleod, I. A. 254 Abstraction 164

Makinen, E. 379, 438 Access methods 397
Malbani, A see Agrawal, D. Action research 98
Mancini, L. and Shrivastava, S. K. 503 Action systems 302
Marshall, R. 245 Active messages 542
Martel, C. U. see Naor, D. Adaptive reorganisation 397
Matloff, N.S. see Naor, D. Algorithms 406, 415, 444
McNeill, T. see Campbell, D. Application architecture 514
Michie, D. 559 Application software 522
Miranda, E. see Dollimore, J. Architectural design 215
Morgan, K., Morris, R. L. and Gibbs, S. 265 Architecture independent propramming languages 302
Morris, R. L. see Morgan, K. Architectures 173
Artificial intelligence 52
Naor, D., Martel, C. U. and Matloff, N.S. 428 Artificial intelligence programming 153
Nipkow, T. 34 Attribute grammars 64
Noble, F. 113 Augmented data manipulator network 207
Autodescriptivity 380

Xu, Wang see Dollimore, J.

O’Docherty, M. H. and Daskalakis, C. N. 225
O’Donoghue, P. G. see Hull, M. E. C. Ballot sequence 438
Olariu, S., Overstreet, C. M. and Wen, Z. 423 Bandwidth 207
Olerup, A. 215 Baseline network 207
Orman, L. 73 BD tree 415

Ou, S. F. and Tharp, A. L. 455 Binary search trees 444
Overstreet, C.M. see Olariu, S. Binary trees 379, 438
Book reviews 182
Paakki, J. 64 Boolean formulas 279
Padawitz, P. 42 B-trees 386, 397, 406, 428
Padget, J., Bradford, R. and Fitch, J. 311 Business policy 122
Paker, Y. see Son, N. T.
Perrott, R. see Stewart, A. CASE 182
Pong, L. see Tse, T. H. Cellular automation 52
Pong, M-C. 320 Client-server model 80
Poo, C.-C. D. 122 Closed world assumption 239
Puppo, E. see Ancona, M. Code generation 64
Codeword 379
Rewitzky, I. M. see Brink, C. Compiler construction 64
Riordon, J. S. see Bodorik, P. Completion 20
Rohl, J.S. 569 Computational complexity 475
Ruzicka, P. 475 Computer hardware description languages 195
Computer networks 534, 542
Schmidt, R. A. see Brink, C. Concurrent maintenance 80

(vi) THE COMPUTER JOURNAL, VOL. 34, 1991

|
i
4
L
|
i
|
Te
|

Concurrent programming 302, 311, 320, 345
Conditional reduction 42

Consistent sharing of objects 514
Constraint maintenance 73

Constructive rewriting 34, 42

Content retrieval 225

Content scanning 245

Contingency 98

Coordination Model 542

Cooperating processes 331

Correcting query processing strategies 551
Counting 279

Critical success factors 113

Crossbar switch network 207

CSCW application platform 514

CSP 302

DAP FORTRAN 377

Data flow computing 52

Data model design 73

Data models 225

Data structure maintenance policy 80
Data structures 195, 397, 423, 428, 444
Database constraints 73

Databases 282, 397, 415

Dataflow 302

Deadlock 207, 331, 345, 493

Deap 423

Decision rules 559

Decision tables 358
Decision-to-decision graph 350
Deductive databases 239

Definite clause grammar 64
Degradable systems 80

Delta networks 207

Dependability 173

Design 215

Design and analysis of algorithms 475
Design criteria 73

Design procedure 73

Design process 215

Dialogue design 132

Digitised pictures 377

Directed acyclic graph 282
Disjunctive normal form 279

Display design 132

Distributed active messages 542
Distributed algorithms 475
Distributed computer networks 475
Distributed databases 551
Distributed hardware 482
Distributed objects 514

Distributed systems 80, 503, 522, 534, 542
Distribution 173, 290, 311

Dynamic (adaptive) query processing 551
Dynamic networks 542

Dynamic state information 331
Dynamic storage allocation 386

EDDA 143

Electronic mail 542

Equational reasoning 2, 16, 20
Equational theories 2, 16
Equivalence class 186

Event list 428

Experimental evaluation 265
Experimental measurements 428
Expert systems 245

Exploratory programming 153

Fast Fourier transform 362
Fault-tolerance 503, 534

File organisation 397

File structures 415

Flexible arrays 386

Fluid approximation model 80
Formula rewriting 34
FORTRAN 77 373
Fragmentation 386

Full-text databases 245
Functional simulation 195

Gamma networks 207

Garbage collection 503

Garbage collection algorithms 80
Goal 215

Goal reduction 42

Graphical interface 320
Graphical languages 320
Graphs 195, 215

Hashing 455, 469

HCI methods 132

Heap 423, 428

Heapsort 88

Height-balancing 406
Heterogeneity 522

Hierarchical models 195
HOOD 164

Hopfield net 92

Horn clauses 42

HOS 143

Human activity systems 98
Human computer interaction 132, 265
Human computer interface 98
Human interface preferences 265
Hypercube 493

Hypermedia 225

Hypertext 245

ICL DAP 377

Image databases 225
Implementation 113

Incomplete information 239
Index sequential access 397
Index sequential files 406
Indexing 397

Information analysis 132
Information extraction 331
Information modelling 98
Information processing 331
Information retrieval 254
Information systems 98, 122, 225
Information systems design 215
Information systems development methodologies 113
Information transferring 331
Insertion costs 455

Integrity constraint 282
Intelligent mail 542

Interacting defaults 239
Interactive graphics 320
Interconnection networks 482, 493
Interface design 265
Inter-process communication 331
IPSC 52

Isabelle 34

JSD 122, 132, 164
JSP 164, 566

Kernel 482

Keywords 469

Knowledge databases 225
Knowledge-base systems 245
Knuth-Bendix completion 2
Kohonen map 92

K-d tree 415

Letter-oriented keys 469
Level-by-level order 438

Level sequences 438

Linda 302

Linear hashing +55

Linear probing sort 370

Linear search 450

Lisp 311

Location and access transparency 514
Logic of partial functions 380

THE COMPUTER JOURNAL, VOL. 34, 1991

Logic programming 20, 52, 64, 350 Priority queues 423, 428
Long term reliable storage of objects 514 Privacy and protection of information 514
Lower bounds in computational complexities 475 Process management 331
L-sequences 438 Process synchronisation 164

Program inversion 566
Maintenance cost 73 Program transformation 569
Management of change 113 Program understanding 331
Manual design 73 Program verification 42
Many-sorted rewriting 16 Programming environments 153
Many-valued logic 380 Prolog
Markup languages 254 Prolog-based systems 245
Mascot 3 164 Propagation protocols 534
Matrices 215 Propositional logic 380
Memory management 386, 455 Protocol management 331
MERISE 182 Protocols 475
Message processing 331 Prototyping 98
Messages and meta-messages 331 Proxies 514
Method integration 132 P-sequences 438
Methodologies 98, 122, 164, 182 Pseudo-Lexicographical permuation generation 569
Miranda 290 PSL 143
Misfit 215
ML 34 Query languages 254
Modal logic 245 Query optimisation 551
Modelling 164 Queueing systems 80
Monte Carlo algorithm 279 Quicksort 88
Mulfiprefix 302
Multidimensional data structures 415 Real-time 164, 173
Multikey searching 415 Recursion 282
Multimedia 225, 245 Reference counting 503
Multimedia databases 225, 245 Reliability 503
Multi-processor interconnection networks 207 Remote procedure calls 503
Multi-processor systems 482, 493 Replicas of shared objects in users workstations 514
Multistage interconnection networks 207 Replicated data 534
Multivariate data analysis 559 Requirements definition 215
Multiview 98 Requirements specification 143, 164
Mutual exclusion problems 345 Reversal 569
M-way trees 406 Rewrite rules 2

Rhombic crossbar switch networks 207
NAG 362 Rich picture 98
Narrowing 42 Rotation 379, 569
Natural language processing 245 Routing 493
Negation as failure 239 - Routing problems 475
Neural description language 92 RSL 143
Neural networks 92 Rule-structured classification 559
NRDC 272

SADT 143
Object-based systems 503 Safe defaults 239
Object-oriented databases 225 Safety critical 173
Object-oriented design 164 Sale’s algorithm 373
Object-oriented programming 225, 311 SAMM_ 143
OCCAM _ 52, 302 Scan 302
Office information systems 113 Scanning 64
Open world assumption 239 Scientific data bases 245
Operating systems 345, 469, 482 Search trees 406
Optimal rewriting 20 Searching 450
Order-sorted rewriting 16 Secondary clustering 455
Organisation design 113 Self-adjusting data structures 444
Orphan detection 503 Self-organizing search 450
Overflow technique 397 Semantic analysis 64
Overhead 551 Semantic nets 225
Overlapping connectivity networks 207 Semantics and pragmatics 245
Semaphores 345
Page faults 428 Sequential lists 450
Parallel machine interface 302 SGML 254
Parallel processing 52 Shared model 514
Parallel programming 345 Shared objects 514
Parallelism 164, 290 Shellsort 88
Parsing 64, 373 Sigma networks 207
Partial-match queries 415 SIMD 52
Participation 98 SIMD computation 377
Pascal 406 SIMD implementation 377
Path predicate 350 Simulation 428
#P-complete 279 Single-probe retrieval 455
Performance 415 Single-sorted rewriting 16
Performance evaluation 80, 551 Socio-technical approach 98, 113, 122, 182
Periodic maintenance 80 Soft systems 98, 113
Permutation pairs 438 Software engineering 522, 559
Permutations 569 Software factory 522
PRAM 302 Software methodologies 153

(viii) THE COMPUTER JOURNAL, VOL. 34, 1991

|
. |
L
-
§
g
q
i
1 |
. |
q
|
|
4
* |
]
j
|
i
4

Software tools 153
Software verification 350
Sorting 186, 370

Sorting algorithm 88
Specification languages 143
Splay trees 428

SSADM _ 182

Stability analysis 80
Starvation 345

Static processing 551
Stochastic processes 80
Storage structures 397
Strategic applications 113
Strategy 113

Strategy execution phases 551
Structural description 195
Structure clashes 566
Structured methods 132
Structured programming 566
Structured system design 164
Subsumption 2
Superposition 2

Symbolic evaluation 350
Synchronisation 534
Systems analysis 132
Systems approach 98
Systems evolution 122

Task analysis 132
Techniques 98
Term complexity 2

Term reduction 42

Term rewriting 2, 16, 20, 34, 42
Termination 20

Text retrieval 254

Theorem proving 20, 34, 42
Thinning algorithms 377
Timing analysis 132

Tools 98

Total order 186

Transparent remote method invocation 514
Transputer 52, 290

Tree permutations 438

U-list 282

Unification confluence 2

Unitary thickness skeletons 377

UNITY 302

User interfaces for shared information 514
User modelling 245

VDM 380
Viewpoint 350
Virtual memory 428
VLSI CAD 195

Weight sequences 438
Weighted path length 444
Worst-case analysis 475

Zak’s sequences 438

THE COMPUTER JOURNAL, VOL. 34, 1991

(ix)